A New Approach for Task Level Computational Resource Bi-partitioning

نویسندگان

  • Gang Wang
  • Wenrui Gong
  • Ryan Kastner
چکیده

An essential problem for hardware/software codesign is the partitioning of an application onto the computational resources. This paper presents a novel approach for the task level resource partitioning problem. Our approach is based on the Ant System algorithm, a meta-heuristic method inspired by the study of the behaviors of ants. In our algorithm, a collection of agents cooperate using distributed and local heuristic information to effectively explore the search space. An iterative stochastic decision making process is carried by the agents in order to optimally allocate tasks onto either the general purpose processor or the reconfigurable logic. Experiments show that the proposed algorithm provides robust results that are qualitatively close to the optimal with minor computational cost.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Bi-Objective Model for a Multi-Mode Resource-Constrained Project Scheduling Problem with Discounted Cash Flows and four Payment Models

The aim of a multi-mode resource-constrained project scheduling problem (MRCPSP) is to assign resource(s) with the restricted capacity to an execution mode of activities by considering relationship constraints, to achieve pre-determined objective(s). These goals vary with managers or decision makers of any organization who should determine suitable objective(s) considering organization strategi...

متن کامل

A Bi-level Formulation for Centralized Resource Allocation DEA Models

In this paper, the common centralized DEA models are extended to the bi-level centralized resource allocation (CRA) models based on revenue efficiency. Based on the Karush–Kuhn–Tucker (KKT) conditions, the bi-level CRA model is reduced to a one-level mathematical program subject to complementarity constraints (MPCC). A recurrent neural network is developed for solving this one-level mathematica...

متن کامل

Resource re-allocation at network units by using of bi-level data envelopment analysis

The lack of renewable primary resources is one of the most serious challenges in recent decades. So under this circumstance, managers are looking for appropriate solutions for the optimal use of these resources to improve the efficiency of the under management units.  One of the most widely used techniques in finding the optimal resource is data envelopment analysis (DEA). So in this paper, in ...

متن کامل

A Non-linear Integer Bi-level Programming Model for Competitive Facility Location of Distribution Centers

The facility location problem is a strategic decision-making for a supply chain, which determines the profitability and sustainability of its components. This paper deals with a scenario where two supply chains, consisting of a producer, a number of distribution centers and several retailers provided with similar products, compete to maintain their market shares by opening new distribution cent...

متن کامل

Hybrid Meta-heuristic Algorithm for Task Assignment Problem

Task assignment problem (TAP) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. TAP is a combinatorial optimization problem and NP-complete. This paper proposes a hybrid meta-heuristic algorithm for solving TAP in a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003